By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 6, Issue 2, pp. 201-402

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Optimum Sequence Trees

Masahiro Miyakawa, Toshitsugu Yuba, Yoshio Sugito, and Mamoru Hoshi

pp. 201-234

BibTeX  Abstract Full Text:  PDF

A Best Possible Bound for The Weighted Path Length of Binary Search Trees

Kurt Mehlhorn

pp. 235-239

BibTeX  Abstract Full Text:  PDF

Quicksort with Equal Keys

Robert Sedgewick

pp. 240-267

BibTeX  Abstract Full Text:  PDF

Some Remarks on $p$-Way Merging

Janet Fabri

pp. 268-271

BibTeX  Abstract Full Text:  PDF

Constraints on Structural Descriptions: Local Transformations

Aravind K. Joshi and Leon S. Levy

pp. 272-284

BibTeX  Abstract Full Text:  PDF

A Completeness Criterion for Spectra

T. Hikita and A. Nozaki

pp. 285-297

BibTeX  Abstract Full Text:  PDF

Superconcentrators

Nicholas Pippenger

pp. 298-304

BibTeX  Abstract Full Text:  PDF

On Isomorphisms and Density of $NP$ and Other Complete Sets

L. Berman and J. Hartmanis

pp. 305-322

BibTeX  Abstract Full Text:  PDF

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Jr., and Vaughan R. Pratt

pp. 323-350

BibTeX  Abstract Full Text:  PDF

Stable Sorting and Merging with Optimal Space and Time Bounds

Luis Trabb Pardo

pp. 351-372

BibTeX  Abstract Full Text:  PDF

The Depth of All Boolean Functions

W. F. McColl and M. S. Patterson

pp. 373-380

BibTeX  Abstract Full Text:  PDF

Some Preservation Properties of Normal Form Grammars

David B. Benson

pp. 381-402

BibTeX  Abstract Full Text:  PDF